Code generation models have achieved impressive performance. However, they tend to be brittle as slight edits to a prompt could lead to very different generations; these robustness properties, critical for user experience when deployed in real-life applications, are not well understood. Most existing works on robustness in text or code tasks have focused on classification, while robustness in generation tasks is an uncharted area and to date there is no comprehensive benchmark for robustness in code generation. In this paper, we propose ReCode, a comprehensive robustness evaluation benchmark for code generation models. We customize over 30 transformations specifically for code on docstrings, function and variable names, code syntax, and code format. They are carefully designed to be natural in real-life coding practice, preserve the original semantic meaning, and thus provide multifaceted assessments of a model's robustness performance. With human annotators, we verified that over 90% of the perturbed prompts do not alter the semantic meaning of the original prompt. In addition, we define robustness metrics for code generation models considering the worst-case behavior under each type of perturbation, taking advantage of the fact that executing the generated code can serve as objective evaluation. We demonstrate ReCode on SOTA models using HumanEval, MBPP, as well as function completion tasks derived from them. Interesting observations include: better robustness for CodeGen over InCoder and GPT-J; models are most sensitive to syntax perturbations; more challenging robustness evaluation on MBPP over HumanEval.

While pre-trained language models (LM) for code have achieved great success in code completion, they generate code conditioned only on the contents within the file, i.e., in-file context, but ignore the rich semantics in other files within the same project, i.e., cross-file context, a critical source of information that is especially useful in modern modular software development. Such overlooking constrains code language models' capacity in code completion, leading to unexpected behaviors such as generating hallucinated class member functions or function calls with unexpected arguments. In this work, we develop a cross-file context finder tool, CCFINDER, that effectively locates and retrieves the most relevant cross-file context. We propose CoCoMIC, a framework that incorporates cross-file context to learn the in-file and cross-file context jointly on top of pretrained code LMs. CoCoMIC successfully improves the existing code LM with a 19.30% relative increase in exact match and a 15.41% relative increase in identifier matching for code completion when the cross-file context is provided.

Recently, there has been increasing interest in synthesizing data to improve downstream text-to-SQL tasks. In this paper, we first examined the existing synthesized datasets and discovered that state-of-the-art text-to-SQL algorithms did not further improve on popular benchmarks when trained with augmented synthetic data. We observed two shortcomings: illogical synthetic SQL queries from independent column sampling and arbitrary table joins. To address these issues, we propose a novel synthesis framework that incorporates key relationships from schema, imposes strong typing, and conducts schema-distance-weighted column sampling. We also adopt an intermediate representation (IR) for the SQL-to-text task to further improve the quality of the generated natural language questions. When existing powerful semantic parsers are pre-finetuned on our high-quality synthesized data, our experiments show that these models have significant accuracy boosts on popular benchmarks, including new state-of-the-art performance on Spider.

关于文本到SQL语义解析的最新研究取决于解析器本身或基于简单的启发式方法来理解自然语言查询（NLQ）。合成SQL查询时，没有可用的NLQ的明确语义信息，从而导致不良的概括性能。此外，如果没有词汇级的细粒度查询理解，查询与数据库之间的链接只能依赖模糊的字符串匹配，这会导致实际应用中的次优性能。考虑到这一点，在本文中，我们提出了一个基于令牌级的细粒度查询理解的通用，模块化的神经语义解析框架。我们的框架由三个模块组成：命名实体识别器（NER），神经实体接头（NEL）和神经语义解析器（NSP）。通过共同建模查询和数据库，NER模型可以分析用户意图并确定查询中的实体。 NEL模型将类型的实体链接到数据库中的模式和单元格值。解析器模型利用可用的语义信息并链接结果并根据动态生成的语法合成树结构的SQL查询。新发布的语义解析数据集的Squall实验表明，我们可以在WikiableQuestions（WTQ）测试集上实现56.8％的执行精度，这使最先进的模型的表现优于2.7％。

关系提取是一项重要但具有挑战性的任务，旨在从文本中提取所有隐藏的关系事实。随着深层语言模型的发展，关系提取方法在各种基准上都取得了良好的性能。但是，我们观察到以前方法的两个缺点：首先，在各种关系提取设置下没有统一的框架可以很好地工作；其次，有效利用外部知识作为背景信息。在这项工作中，我们提出了一种知识增强的生成模型来减轻这两个问题。我们的生成模型是一个统一的框架，可在各种关系提取设置下依次生成关系三胞胎，并明确利用来自知识图（KG）的相关知识来解决歧义。我们的模型在包括WebNLG，NYT10和Tacred在内的多个基准和设置上实现了卓越的性能。

学习高质量的对话表示对于解决各种面向对话的任务至关重要，尤其是考虑到对话系统通常会遇到数据稀缺。在本文中，我们介绍了对话句子嵌入（DSE），这是一种自我监督的对比学习方法，它学习有效的对话表示，适合各种对话任务。 DSE通过连续进行与对比度学习的正面对话的连续对话来从对话中学习。尽管它很简单，但DSE的表现能力比其他对话表示和普遍的句子表示模型要好得多。我们评估DSE的五个下游对话任务，这些任务检查了不同语义粒度的对话表示。几次射击和零射击设置的实验表明，DSE的表现要优于基线。例如，它在6个数据集中的1-Shot意图分类中比最强的无监督基线实现了13％的平均绩效提高。我们还提供了有关模型的好处和局限性的分析。

汽车MMWAVE雷达在高级驾驶员辅助系统（ADA）和自动驾驶中起关键作用。基于深度学习的实例细分可以从雷达检测点实时对象识别。在常规培训过程中，准确的注释是关键。然而，由于雷达检测点的高质量注释，由于其歧义和稀疏性，要实现挑战。为了解决这个问题，我们提出了一种实施基于雷达检测点的实例细分的对比学习方法。我们根据地面真相标签定义正面和负样品，将对比度损失首先训练模型，然后对以下下游任务进行微调。此外，可以将这两个步骤合并为一个，并且可以为未标记的数据生成伪标签，以进一步提高性能。因此，我们的方法有四种不同的培训设置。实验表明，当仅适用于一小部分培训数据时，我们的方法仍然可以与以100％基真实信息进行监督的方式实现可比的性能。

目前用于开放域问题的最先进的生成模型（ODQA）专注于从非结构化文本信息生成直接答案。但是，大量的世界知识存储在结构化数据库中，并且需要使用SQL等查询语言访问。此外，查询语言可以回答需要复杂推理的问题，以及提供完全的解释性。在本文中，我们提出了一个混合框架，将文本和表格证据占据了输入，并根据哪种形式更好地回答这个问题而生成直接答案或SQL查询。然后可以在关联的数据库上执行生成的SQL查询以获得最终答案。据我们所知，这是第一种将Text2SQL与ODQA任务应用于ODQA任务的论文。凭经验，我们证明，在几个ODQA数据集上，混合方法始终如一地优于仅采用大边缘的均匀输入的基线模型。具体地，我们使用T5基础模型实现OpenSquad数据集的最先进的性能。在一个详细的分析中，我们证明能够生成结构的SQL查询可以始终带来增益，特别是对于那些需要复杂推理的问题。

我们提出了一个新的框架，在增强的自然语言（TANL）之间的翻译，解决了许多结构化预测语言任务，包括联合实体和关系提取，嵌套命名实体识别，关系分类，语义角色标记，事件提取，COREREFED分辨率和对话状态追踪。通过培训特定于特定于任务的鉴别分类器来说，我们将其作为一种在增强的自然语言之间的翻译任务，而不是通过培训问题，而不是解决问题，而是可以轻松提取任务相关信息。我们的方法可以匹配或优于所有任务的特定于任务特定模型，特别是在联合实体和关系提取（Conll04，Ade，NYT和ACE2005数据集）上实现了新的最先进的结果，与关系分类（偶尔和默示）和语义角色标签（Conll-2005和Conll-2012）。我们在使用相同的架构和超参数的同时为所有任务使用相同的架构和超级参数，甚至在培训单个模型时同时解决所有任务（多任务学习）。最后，我们表明，由于更好地利用标签语义，我们的框架也可以显着提高低资源制度的性能。

In this work, we model abstractive text summarization using Attentional Encoder-Decoder Recurrent Neural Networks, and show that they achieve state-of-the-art performance on two different corpora. We propose several novel models that address critical problems in summarization that are not adequately modeled by the basic architecture, such as modeling key-words, capturing the hierarchy of sentence-toword structure, and emitting words that are rare or unseen at training time. Our work shows that many of our proposed models contribute to further improvement in performance. We also propose a new dataset consisting of multi-sentence summaries, and establish performance benchmarks for further research.